The average connectivity of a graphBEINEKE, Lowell W; OELLERMANN, Ortrud R; PIPPERT, Raymond E et al.Discrete mathematics. 2002, Vol 252, Num 1-3, pp 31-45, issn 0012-365XArticle

Rigidity and Non-local Connectivity of Julia Sets of Some Quadratic PolynomialsLEVIN, Genadi.Communications in mathematical physics. 2011, Vol 304, Num 2, pp 295-328, issn 0010-3616, 34 p.Article

On the existence of edge cuts leaving several large componentsRAUTENBACH, Dieter; VOLKMANN, Lutz.Discrete mathematics. 2009, Vol 309, Num 6, pp 1703-1707, issn 0012-365X, 5 p.Article

Connectivity of distance graphsCURRIE, J. D.Discrete mathematics. 1992, Vol 103, Num 1, pp 91-94, issn 0012-365XArticle

Pancyclism in hamiltonian graphsAMAR, D; FLANDRIN, E; FOURNIER, I et al.Discrete mathematics. 1991, Vol 89, Num 2, pp 111-131, issn 0012-365XArticle

Connectivity of Kronecker products by K2WEI WANG; ZHIDAN YAN.Applied mathematics letters. 2012, Vol 25, Num 2, pp 172-174, issn 0893-9659, 3 p.Article

Local connectivity of Julia sets for unicritical polynomialsKAHN, Jeremy; LYUBICH, Mikhail.Annals of mathematics. 2009, Vol 170, Num 1, pp 413-426, issn 0003-486X, 14 p.Article

A concise characterization of 3D simple pointsFOUREY, Sébastien; MALGOUYRES, Rémy.Lecture notes in computer science. 2000, pp 27-36, issn 0302-9743, isbn 3-540-41396-0Conference Paper

Graph algorithms for conformance testing using the rural Chinese postman tourSHEN, Y. N; LOMBARDI, F.SIAM journal on discrete mathematics (Print). 1996, Vol 9, Num 4, pp 511-528, issn 0895-4801Article

A New Family of κ-in-a-Row GamesWU, I-Chen; HUANG, Dei-Yen.Lecture notes in computer science. 2006, pp 180-194, issn 0302-9743, isbn 978-3-540-48887-3, 1Vol, 15 p.Conference Paper

Flat-state connectivity of linkages under dihedral motionsALOUPIS, Greg; DEMAINE, Erik D; TOUSSAINT, Godfried T et al.Lecture notes in computer science. 2002, pp 369-380, issn 0302-9743, isbn 3-540-00142-5, 12 p.Conference Paper

A property of graphs of convex polytopesPERLES, M. A; NAGABHUSHANA PRABHU.Journal of combinatorial theory. Series A. 1993, Vol 62, Num 1, pp 155-157, issn 0097-3165Article

On the connectivity of certain graphs of high girthLAZEBNIK, Felix; VIGLIONE, Raymond.Discrete mathematics. 2004, Vol 277, Num 1-3, pp 309-319, issn 0012-365X, 11 p.Article

Approximating rooted connectivity augmentation problemsNUTOV, Zeev.Lecture notes in computer science. 2003, pp 141-152, issn 0302-9743, isbn 3-540-40770-7, 12 p.Conference Paper

A faster parallel algorithm for k-connectivityIWAMA, K; IWAMOTO, C; OHSAWA, T et al.Information processing letters. 1997, Vol 61, Num 5, pp 265-269, issn 0020-0190Article

Augmenting the Connectivity of Outerplanar GraphsGARCIA, A; HURTADO, F; NOY, M et al.Algorithmica. 2010, Vol 56, Num 2, pp 160-179, issn 0178-4617, 20 p.Article

On the connectivity of (k, g)-cages of even girthYUQING LIN; BALBUENA, Camino; MARCOTE, Xavier et al.Discrete mathematics. 2008, Vol 308, Num 15, pp 3249-3256, issn 0012-365X, 8 p.Article

The structure of crossing separations in matroidsAIKIN, Jeremy; OXLEY, James.Advances in applied mathematics (Print). 2008, Vol 41, Num 1, pp 10-26, issn 0196-8858, 17 p.Article

Note on structural properties and sizes of eigenspaces of min-max functionsQIANCHUAN ZHAO; ZHENG, Da-Zhong.Lecture notes in control and information sciences. 2003, pp 393-400, issn 0170-8643, isbn 3-540-40342-6, 8 p.Conference Paper

A time-space tradeoff for undirected graph traversal by walking automataBEAME, P; BORODIN, A; RAGHAVAN, P et al.SIAM journal on computing (Print). 1999, Vol 28, Num 3, pp 1051-1072, issn 0097-5397Article

Partitioning approach to visualization of large graphsBATAGELJ, V; MRVAR, A; ZAVERSNIK, M et al.Lecture notes in computer science. 1999, pp 90-97, issn 0302-9743, isbn 3-540-66904-3Conference Paper

Fully dynamic 3-dimensional orthogonal graph drawingCLOSSON, M; GARTSHORE, S; JOHANSEN, J et al.Lecture notes in computer science. 1999, pp 49-58, issn 0302-9743, isbn 3-540-66904-3Conference Paper

Coverings and structure of crossing familiesFLEINER, T; JORDAN, T.Mathematical programming. 1999, Vol 84, Num 3, pp 505-518, issn 0025-5610Article

Graph multidrawing : Finding nice drawings without defining niceBIEDL, T; MARKS, J; RYALL, K et al.Lecture notes in computer science. 1998, pp 347-355, issn 0302-9743, isbn 3-540-65473-9Conference Paper

The diameter of the cube-connected cyclesFRIS, I; HAVEL, I; LIEBL, P et al.Information processing letters. 1997, Vol 61, Num 3, pp 157-160, issn 0020-0190Article